Two-level Overlapping Schwarz Method for H(curl) in 2d for Irregular Subdomains
نویسنده
چکیده
A bound is obtained for the condition number of a two-level overlapping Schwarz algorithm for problems posed in H(curl) in 2D, where the subdomains are only assumed to be uniform in the sense of Peter Jones. The coarse space is based on energy minimization and its dimension equals the number of subdomain edges. Local direct solvers over overlapping subdomains are also used. The bound is independent of jumps in the coefficients across the interface between the subdomains and depends only on a few geometric parameters of the decomposition. Numerical results that verify the result are shown, including some with subdomains with fractal edges and others obtained by a mesh partitioner.
منابع مشابه
A Two-level Overlapping Schwarz Method for H(curl) in Two Dimensions with Irregular Subdomains
A bound is obtained for the condition number of a two-level overlapping Schwarz algorithm for problems posed in H(curl) in two dimensions, where the subdomains are only assumed to be uniform in the sense of Peter Jones. The coarse space is based on energy minimization and its dimension equals the number of interior subdomain edges. Local direct solvers are used on the overlapping subdomains. Ou...
متن کاملOverlapping Schwarz methods in H(curl) on polyhedral domains
We consider domain decomposition preconditioners for the linear algebraic equations which result from finite element discretization of problems involving the bilinear form α(·, ·) + (curl ·, curl ·) defined on a polyhedral domain Ω. Here (·, ·) denotes the inner product in (L(Ω)) and α is a positive number. We use Nedelec’s curl-conforming finite elements to discretize the problem. Both additiv...
متن کاملAn Overlapping Schwarz Algorithm for Raviart-Thomas Vector Fields with Discontinuous Coefficients
Overlapping Schwarz methods form one of two major families of domain decomposition methods. We consider a two-level overlapping Schwarz method for Raviart-Thomas vector fields. The coarse part of the preconditioner is based on the energy-minimizing extensions and the local parts are based on traditional solvers on overlapping subdomains. We show that the condition number grows linearly with the...
متن کاملAn Iterative Substructuring Algorithm for Two-Dimensional Problems in H(curl)
A domain decomposition algorithm, similar to classical iterative substructuring algorithms, is presented for two-dimensional problems in the space H0(curl; Ω). It is defined in terms of a coarse space and local subspaces associated with individual edges of the subdomains into which the domain of the problem has been subdivided. The algorithm differs from others in three basic respects. First, i...
متن کاملFast Solvers and Schwarz Preconditioners for Spectral Nédélec Elements for a Model Problem in H(curl)
1 1. Introduction. In this paper, we present fast solvers and overlapping additive Schwarz methods for spectral Nédélec element discretizations for a model problem in H(curl). Results of numerical experiments in two dimensions and arguments for a theoretical condition number bound in two and three dimensions are presented. We first show the derivation of the model problem in the implicit time d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013